Fréchet inequalities via convex optimization
نویسندگان
چکیده
Quantifying the risk carried by an aggregate position Sd := ∑d i=1Xi comprising many risk factors Xi is fundamental to both insurance and financial risk management. Fréchet inequalities quantify the worst-case risk carried by the aggregate position given distributional information concerning its composing factors but without assuming independence. This marginal factor modeling of the aggregate position in terms of its risk factors Xi leaves, however, the distribution of Sd ambiguous. The resulting distributional ambiguity can be traced back directly to the lack of dependence structure imposed between the risk factors. Fréchet inequalities implicitly uphold already the work of George Boole on probabilistic logic but were explicitly derived by Maurice Fréchet only in 1935. These inequalities can be considered rules about how to bound calculations involving probabilities without assuming independence or, indeed, without making any dependence assumptions whatsoever. It is exactly this robustness to obscure risk dependencies which have stimulated their renewed interest in the post crisis economy. We will approach these Fréchet inequalities using a modern convex optimization lens. Our novel perspective provides data friendly computational tools applicable to practical Fréchet problems. Two important data friendly classes of Fréchet problems are presented, both of which are shown to admit exact tractable convex optimization reformulations. The efficacy of our approach is illustrated using a small insurance management problem.
منابع مشابه
Linear Time Varying MPC Based Path Planning of an Autonomous Vehicle via Convex Optimization
In this paper a new method is introduced for path planning of an autonomous vehicle. In this method, the environment is considered cluttered and with some uncertainty sources. Thus, the state of detected object should be estimated using an optimal filter. To do so, the state distribution is assumed Gaussian. Thus the state vector is estimated by a Kalman filter at each time step. The estimation...
متن کاملA generalized form of the Hermite-Hadamard-Fejer type inequalities involving fractional integral for co-ordinated convex functions
Recently, a general class of the Hermit--Hadamard-Fejer inequality on convex functions is studied in [H. Budak, March 2019, 74:29, textit{Results in Mathematics}]. In this paper, we establish a generalization of Hermit--Hadamard--Fejer inequality for fractional integral based on co-ordinated convex functions.Our results generalize and improve several inequalities obtained in earlier studies.
متن کاملSequential Optimality Conditions and Variational Inequalities
In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...
متن کاملInequalities of Ando's Type for $n$-convex Functions
By utilizing different scalar equalities obtained via Hermite's interpolating polynomial, we will obtain lower and upper bounds for the difference in Ando's inequality and in the Edmundson-Lah-Ribariv c inequality for solidarities that hold for a class of $n$-convex functions. As an application, main results are applied to some operator means and relative operator entropy.
متن کاملExploring the Relationship Between Max-Cut and Stable Set Relaxations
The max-cut and stable set problems are two fundamental NP -hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set problem can be easily transformed into a max-cut instance. Moreover, Laurent, Poljak, Rendl and others have shown that any convex set containing the cut polytope yields, via a suitable projection, a convex set containing t...
متن کامل